Socially-Optimal and Truthful Online Spectrum Auction for Secondary Communication∗†

نویسندگان

  • Hongxing Li
  • Chuan Wu
  • Zongpeng Li
چکیده

Spectrum auctions are efficient mechanisms for licensed users to relinquish their under-utilized spectrum to secondary links for monetary remuneration. Truthfulness and social welfare maximization are two natural goals in such auctions, but cannot be achieved simultaneously with polynomialtime complexity by existing methods, even in a static network with fixed parameters. The challenge escalates in practical systems with QoS requirements and volatile traffic demands for secondary communication. Online, dynamic decisions are required for rate control, channel evaluation/bidding, and packet dropping at each secondary link, as well as for winner determination and pricing at the primary user. This work proposes an online spectrum auction framework with cross-layer decision making and randomized winner determination on the fly. The framework is truthful-in-expectation, and achieves close-to-offline-optimal time-averaged social welfare and individual utilities with polynomial time complexity. A new method is introduced for online channel evaluation in a stochastic setting. Simulation studies further verify the efficacy of the proposed auction in practical scenarios.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Truthful Auction Mechanism for Heterogeneous Spectrum Allocation in Wireless Networks

Secondary spectrum auction is widely applied in wireless networks for mitigating the spectrum scarcity. In a realistic spectrum trading market, the requests from secondary users often specify the usage of a fixed spectrum frequency band in a certain geographical region and require a duration time in a fixed available time interval. Considering the selfish behaviors of secondary users, it is imp...

متن کامل

Near-Optimal Truthful Auction Mechanisms in Secondary Spectrum Markets

In this work, we study spectrum auction problem where each request from secondary users has spatial, temporal, and spectral features. With the requests of secondary users and the reserve price of the primary user, our goal is to design truthful mechanisms that will either maximize the social efficiency or maximize the revenue of the primary user. As the optimal conflictfree spectrum allocation ...

متن کامل

Auctioning based Coordinated TV White Space Spectrum Sharing for Home Networks

The idea of having the geolocation database monitor the secondary use of TV white space (TVWS) spectrum and assist in coordinating the secondary usage is gaining ground. Considering the home networking use case, we leverage the geolocation database for interference-aware coordinated TVWS sharing among secondary users (home networks) using shortterm auctions, thereby realize a dynamic secondary ...

متن کامل

Truthful Spectrum Auctions With Approximate Social-Welfare

In cellular networks, a recent trend is to make spectrum access dynamic in the spatial and temporal dimensions, for the sake of efficient utilization of spectrum. In such a model, the spectrum is divided into channels and periodically allocated to competing base stations using an auction-based market mechanism. An efficient auction mechanism is essential to the success of such a dynamic spectru...

متن کامل

Decomposing Truthful and Competitive Online Double Auctions

In this paper, we study online double auctions, where multiple sellers and multiple buyers arrive and depart dynamically to exchange one commodity. We show that there is no deterministic online double auction that is truthful and competitive for maximising social welfare in an adversarial model. However, given the prior information that sellers are patient and the demand is not more than the su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014